Formal language - PDFSEARCH.IO - Document Search Engine

Formal language
Results: 1838

#	Item
621	Automata theory for XML researchers∗ Frank Neven University of Limburg 1 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:40 Mathematics Tree automaton Nondeterministic finite automaton Deterministic finite automaton Symbol Finite-state machine Tree Regular language Formal language Automata theory Theoretical computer science Computer science
622	Formal analysis and implementation of the Faust programming language Report of first PhD year Imré Frotier de la Messelière1 PhD advisor: Pierre Jouvelot1 PhD co-advisor: Jean-Pierre Talpin2 Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2014-12-19 09:00:24 Type theory Formal methods Type systems Constraint programming Satisfiability Modulo Theories Type inference Logic programming Hindley–Milner Algorithm Mathematics Theoretical computer science Applied mathematics
623	Noname manuscript No. (will be inserted by the editor) Synchronizing Relations on Words Diego Figueira · Leonid Libkin Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-11-26 07:54:43 Computer science Applied mathematics Regular language Tree automaton Complementation of Büchi automaton Ω-automaton Automata theory Formal languages Theoretical computer science
624	Synchronizing Relations on Words Diego Figueira and Leonid Libkin University of Edinburgh, UK Abstract While the theory of languages of words is very mature, our understanding of relations on words Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-03-01 14:59:36 Mathematics Applied mathematics Regular language Recognizable language Tree automaton Constructible universe Formal languages Automata theory Theoretical computer science
625	In and Out of SSA: A Denotational Specification Sebastian Pop, Pierre Jouvelot†, Georges-Andr´e Silber† Open Source Compiler Engineering, Advanced Micro Devices Inc., Austin, Texas, † ´ CRI, Ecole Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2010-06-03 03:55:11 Logic in computer science Programming language semantics Models of computation Formal methods Procedural programming languages Static single assignment form Denotational semantics Continuation-passing style Statement Software engineering Computing Theoretical computer science
626	Regular Functions Rajeev Alur University of Pennsylvania 1 Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2014-10-13 10:13:47 Theoretical computer science Mathematics Combinatorics on words Models of computation Finite state transducer Finite-state machine Regular expression Regular language String Formal languages Automata theory Combinatorics
627	Graph Logics with Rational Relations and the Generalized Intersection Problem Pablo Barcel´o Diego Figueira Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:07:03 Formal languages Metalogic Computability theory Automata theory Model theory Structure Regular language Decision problem Reduction Theoretical computer science Mathematics Applied mathematics
628	CoqInE: Translating the Calculus of Inductive Constructions into the λΠ-calculus Modulo Mathieu Boespflug1 and Guillaume Burel2 1 McGill University Montr´eal, Qu´ebec, Canada Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2012-07-23 07:37:37 Type theory Dependently typed programming Lambda calculus Formal methods Recursion Calculus of constructions Calculus of inductive constructions Coq Dependent type Programming language theory Mathematics Algebra
629	Dedukti: a Universal Proof Checker Ronan Saillard MINES ParisTech Context The success of formal methods both as tools of practical importance and as objects of intellectual curiosity, has spaw Add to Reading List Source URL: www.cri.ensmp.fr Language: English - Date: 2013-06-14 08:53:53 Theoretical computer science Lambda calculus Proof theory Functional languages Dependently typed programming Higher-order abstract syntax Dependent type Judgment Proof assistant Programming language theory Type theory Mathematical logic
630	Recurrent Reachability Analysis in Regular Model Checking Anthony Widjaja To and Leonid Libkin LFCS, School of Informatics, University of Edinburgh anthony.w.to, Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2008-09-22 08:03:38 Computer science Applied mathematics Tree automaton Regular language Ω-automaton Automata theory Formal languages Theoretical computer science

UPDATE